On the Extension Complexity of Combinatorial Polytopes
نویسندگان
چکیده
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs.
منابع مشابه
Linear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملGeneralised probabilistic theories and conic extensions of polytopes
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone C and its dual C∗. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorisation of the corresponding communication matrix M . We also prove an analogue of Holevo’...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملOn Vertices and Facets of Combinatorial 2-Level Polytopes
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arising in combinatorial settings. Our first contribution is proving that f0(P )fd−1(P ) ≤ d2 for a large collection of families of such polytopes...
متن کاملExtension complexity of polytopes with few vertices or facets
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of d-polytopes with at most d + 4 vertices according to their extension complexity: Out of the super-exponentially many d-polytopes with d+4 vertices, all have extension complexity d+ 4 except for some families of size θ(d). On the other hand, we show that generic re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 153 شماره
صفحات -
تاریخ انتشار 2013